solving the problem of scheduling unrelated parallel machines with limited access to jobs

نویسندگان

mohammadreza naghibi

abolfazl adressi

چکیده

nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel machines scheduling, when machines have different technological levels and are not necessarily able to process each one of the existing jobs in the group of jobs and in many of the industrial environments, a sequence dependent setup time takes place during exchanging jobs on the machines. in this research, the unrelated parallel machines scheduling problem has been studied considering the limitations of sequence dependent setup time of processing of jobs and limited accessibility to machines and jobs with the purpose of minimizing the total weighting lateness and earliness times. an integer scheduling model is proposed for this problem. also, a meta-heuristically combined method consisting of genetic algorithm and particle swarm optimization (pso) algorithm for its solutions is proposed. the obtained results of the proposed algorithm show that the proposed algorithm is very efficient especially in problems with large dimensions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

Flexible flowshop scheduling with equal number of unrelated parallel machines

This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

متن کامل

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

Scheduling unrelated parallel machines with optional machines and jobs selection

In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should be used and it is desirable to employ only a subset of the parallel machines. This is referred to as “Not all Machines” or NAM in short. This environment applies frequently in produ...

متن کامل

Solving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of modern processes in manufacturing and production

ناشر: islamic azad univesity, najafabad branch

ISSN

دوره 3

شماره 2 2014

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023